Simple Dis rete Time Models for Performan e Parameters ofMultiplexer with Homogeneous ON - OFF Sour es
نویسندگان
چکیده
The paper addresses the analysis of a single multiplexing node in ATM networks. It presents analyti al models for evaluating the performan e parameters of a multiplexer that has N identi al ON-OFF type input sour es and an output hannel with nite bu er. The hannel speed is assumed to be an integer times of the sour e speed in ON state. A two dimensional Dis rete Time Markov Chain is introdu ed where the two dimensions des ribe the number of ON sour es and the number of ells in the nite bu er at a given time. Two time s ales are de ned in order to ensure a urate results in al ulating the performan e parameters, e.g. ell loss and ell delay. Three alternative models of the ell arrival pro ess are dis ussed and the performan e parameters are derived.
منابع مشابه
Progressive Image Communication over Binary Channels with Additive Bursty Noise
A progressive method for transmission of images over a bursty noise hannel is presented. It is based on dis rete wavelet transform (DWT) oding and hannel-optimized s alar quantization. The main advantage of the proposed system is that it exploits the hannel memory and hen e has superior performan e over a similar s heme designed for the equivalent memoryless hannel through the use of hannel int...
متن کاملHow Fast is ‘-fast’? Performance Analysis of KDD Applications using Hardware Performance Counters on UltraSPARC-III
ABSTRACT Modern pro essors and omputer systems are designed to be eÆ ient and a hieve high performan e with appli ations that have regular memory a ess patterns. For example, dense linear algebra routines an be implemented to a hieve near peak performan e. While su h routines have traditionally formed the ore of many s ienti and engineering appli ations, ommer ial workloads like database and we...
متن کاملÅåååòò Aeìêííò Blockinöýôø Òò Aeìêíëëëò × Ëë Blockinùöö × Ëøøòòòöö Ïóö×ø¹¹¹×× Èöóóððñ× Óúö Ááááð Ääøøø Blockin Blockin×
Abstra t. NTRUEn rypt, proposed in 1996 by Ho stein, Pipher and Silverman, is the fastest known latti e-based en ryption s heme. Its moderate key-sizes, ex ellent asymptoti performan e and onje tured resistan e to quantum omputers make it a desirable alternative to fa torisation and dis rete-log based en ryption s hemes. However, sin e its introdu tion, doubts have regularly arisen on its se ur...
متن کاملDesign of Turbo Codes for Non-Equiprobable Memoryless Sour es
This work addresses the problem of designing Turbo odes for non-uniform binary memoryless or independent and identi ally distributed (i.i.d.) sour es over noisy hannels. The extrinsi information in the de oder is modi ed to exploit the sour e redundan y in the form of non-uniformity; furthermore, the onstituent en oder stru ture is optimized for the onsidered non-uniform i.i.d. sour e to furthe...
متن کاملThe S ale Fa tor: A New Degree of Freedom in Phase Type Approximation
This paper introdu es a uni ed approa h to phase-type approximation in whi h the dis rete and the ontinuous phase-type models form a ommon model set. The models of this ommon set are assigned with a non-negative real parameter, the s ale fa tor. The ase when the s ale fa tor is stri tly positive results in Dis rete phase-type distributions and the s ale fa tor represents the time elapsed in one...
متن کامل